Preference Revision Via Declarative Debugging
نویسندگان
چکیده
Preference criteria are rarely static. Often they are subject to modification and aggregation. The resulting preference criteria may not satisfy the properties of the original ones and must therefore be revised. This paper investigates the problem of revising such preference criteria by means of declarative debugging techniques.
منابع مشابه
Belief Revision in Non-Monotonic Reasoning and Logic Programming
In order to be able to explicitly reason about beliefs, we've introduced a non-monotonic formalism, called the Autoepistemic Logic of Beliefs, AEB, obtained by augmenting classical propositional logic with a belief operator, B. For this language we've deened the static autoepistemic expansions semantics. The resulting non-monotonic knowledge representation framework turned out to be rather simp...
متن کاملBringing Information Extraction out of the Labs: the Pinocchio Environment
Pinocchio is an environment for developing Information Extraction applications. New applications and languages can be covered by just writing declarative resources. Information is represented uniformly throughout the architecture: all the modules use the same input structure and the same type of declarative resources. Modules are implemented via the same basic processors and share a common envi...
متن کاملDebugging for a Declarative Programming Language
This paper investigates debugging in declarative programming languages, concentrating specifically on the integrated functional and logic programming language Escher. The Escher language has types and modules, higher-order and meta-programming facilities, and declarative input/output. It also has a collection of system modules, providing numerous operations on standard data types such as intege...
متن کاملDeclarative Debugging of Membership Equational Logic Specifications
Algorithmic debugging has been applied to many declarative programming paradigms; in this paper, it is applied to the rewriting paradigm embodied in Maude. We introduce a declarative debugger for executable specifications in membership equational logic which correspond to Maude functional modules. Declarative debugging is based on the construction and navigation of a debugging tree which logica...
متن کاملDebugging techniques for declarative languages: Profiling, program slicing and algorithmic debugging
The task of debugging can be arduous. A bug can be evident with a single glance, or it can be hidden in the deepest lurking place of our program. Nevertheless, surprisingly, debugging is one of the software processes that has been mostly abandoned by the scientific community, and the same debugging techniques used twenty years ago are still being used today. The situation is not different regar...
متن کامل